t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes
نویسندگان
چکیده
In this paper, we show that there exists a t-cheater identi able (k; n) threshold secret sharing scheme such as follows for cheating probability " > 0. If k 3t+ 1, then 1. Just k participants are enough to identify who are cheaters. 2. jV i j is independent of n. That is, jV i j = jSj(1=") (t+2) , where S denotes the set of secrets and V i denotes the set of shares of a participant P i , respectively. (Previously, no schemes were known which satisfy both requirements.) Further, we present a lower bound on jV i j for our model and for the model of Tompa and Woll. Our bound for the TW model is much more tight than the previous bound.
منابع مشابه
Cheater Identifiable Secret Sharing Schemes via Multi-Receiver Authentication
We introduce two publicly cheater identifiable secret sharing (CISS) schemes with efficient reconstruction, tolerating t < k/2 cheaters. Our constructions are based on (k, n) threshold Shamir scheme, and they feature a novel application of multi-receiver authentication codes to ensure integrity of shares. The first scheme, which tolerates rushing cheaters, has the share size |S|(n−t)/ n+t+2 in ...
متن کاملAn Efficient t-Cheater Identifiable Secret Sharing Scheme with Optimal Cheater Resiliency
In this paper, we present an efficient k-out-of-n secret sharing scheme, which can identify up to t rushing cheaters, with probability at least 1 − , where 0 < < 1/2, provided t < k/2. This is the optimal number of cheaters that can be tolerated in the setting of public cheater identification, on which we focus in this work. In our scheme, the set of all possible shares Vi satisfies the conditi...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملEfficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
In this paper, we consider three very important issues namely detection, identification and robustness of k-out-of-n secret sharing schemes against rushing cheaters who are allowed to submit (possibly forged) shares after observing shares of the honest users in the reconstruction phase. Towards this we present five different schemes. Among these, first we present two k-out-of-n secret sharing s...
متن کاملAlmost Optimum t-Cheater Identifiable Secret Sharing Schemes
In Crypto’95, Kurosawa, Obana and Ogata proposed a kout-of-n secret sharing scheme capable of identifying up to t cheaters with probability 1 − under the condition t ≤ (k − 1)/3 . The size of share |Vi| of the scheme satisfies |Vi| = |S|/ , which was the most efficient scheme known so far. In this paper, we propose new k-out-ofn secret sharing schemes capable of identifying cheaters. The propos...
متن کامل